Pii: S0925-7721(01)00046-3
نویسندگان
چکیده
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy evaluation scheme with the exact number types provided by LEDA allowing for efficient and exact computation with rational and algebraic geometric objects. It is the first kernel design which uses floating-point filter techniques on the level of geometric constructions. The experiments we present—partly using the CGAL framework—show a great improvement in speed and— maybe even more important for practical applications—memory consumption when dealing with more complex geometric computations. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0925-7721(01)00015-3
In this paper we present a heuristic to reconstruct nonsmooth curves with multiple components. Experiments with several input data reveals the effectiveness of the algorithm in contrast with the other competing algorithms. 2001 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0925-7721(01)00068-2
Reconstruction of polygons from visibility information is known to be a difficult problem in general. In this paper, we consider a special case: reconstruction of orthogonal polygons from horizontal and vertical visibility information and show that this reconstruction can be performed in O(n logn) time. 2002 Elsevier Science B.V. All rights reserved.
متن کامل